Chordal graph

Results: 143



#Item
61Triangulation / Clique / NP-complete problems / Graph coloring / Simplicial complex / Chordal graph / Clique problem / Hadwiger conjecture / Graph theory / Mathematics / Algebraic topology

Graph-theoretic methods in combinatorial (algebraic) topology Michal Adamaszek Universit¨ at Bremen

Add to Reading List

Source URL: projects.au.dk

Language: English - Date: 2013-04-29 03:32:40
62Matching / Eulerian path / Petersen graph / Travelling salesman problem / Graph / Tree / Chordal graph / Hamiltonian path / Planar graph / Graph theory / NP-complete problems / Cubic graph

arXiv:1107.1052v1 [cs.DS] 6 JulThe traveling salesman problem on cubic and subcubic graphs∗ Sylvia Boyd†

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2011-07-06 20:12:57
63Forbidden graph characterization / Split graph / Strongly chordal graph / Path decomposition / Graph theory / Chordal graph / Clique

Studies on Subgraph and Supergraph Enumeration Algorithms Masashi Kiyomi DOCTOR OF

Add to Reading List

Source URL: www.nii.ac.jp

Language: English - Date: 2010-03-08 19:45:48
64Induced path / Matching / Clique / Dominating set / Interval graph / Algebraic topology / Line graph / Path decomposition / Graph theory / Chordal graph / Graph

ALGORITHMIC COMPLEXITY OF FINDING CROSS-CYCLES IN FLAG COMPLEXES MICHAL ADAMASZEK AND JURAJ STACHO Abstract. A cross-cycle in a flag simplicial complex K is an induced subcomplex that is isomorphic to the boundary of a c

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2014-10-30 10:03:20
65Chordal graph / Clique / Maximal independent set / Split graph / Tree decomposition / Cograph / Independent set / Neighbourhood / Clique-sum / Graph theory / Graph operations / NP-complete problems

Independent Set in P5-Free Graphs in Polynomial Time Daniel Lokshtanov∗ Martin Vatshelle∗ Yngve Villanger∗

Add to Reading List

Source URL: www.ii.uib.no

Language: English - Date: 2013-10-25 09:59:52
66Probability theory / Artificial intelligence / Markov random field / Theoretical computer science / Chordal graph / Tree decomposition / Clique / Matching / Belief propagation / Graph theory / Graph operations / Graphical models

1646 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 28,

Add to Reading List

Source URL: webdocs.cs.ualberta.ca

Language: English - Date: 2006-08-28 13:27:03
67Algebraic topology / Chordal graph / Clique complex / Graph / Vietoris–Rips complex / CW complex / Induced path / Maximal independent set / Simplicial complex / Graph theory / Mathematics / Topology

Algorithmic complexity of finding cross-cycles in flag complexes Michal Adamaszek, Juraj Stacho University of Warwick, UK Centre for Discrete Mathematics and its Applications (DIMAP)

Add to Reading List

Source URL: www.mimuw.edu.pl

Language: English - Date: 2015-03-23 03:34:03
68Tree decomposition / Interval graph / Floyd–Warshall algorithm / Neighbourhood / Clique / Split graph / Shortest path problem / Path decomposition / Degeneracy / Graph theory / Graph operations / Chordal graph

Journal of Artificial Intelligence Research–388 Submitted 10/11; publishedComputing All-Pairs Shortest Paths by Leveraging Low Treewidth

Add to Reading List

Source URL: www.jair.org

Language: English - Date: 2012-03-19 16:09:33
69Linkless embedding / Graph embedding / Robertson–Seymour theorem / Minor / Chordal graph / Complete graph / Petersen family / Planar graphs / Graph theory / Topological graph theory / Knot theory

AN ALGORITHM FOR DETECTING INTRINSICALLY KNOTTED GRAPHS arXiv:1109.1030v2 [math.GT] 9 OctJONATHAN MILLER AND RAMIN NAIMI

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2013-10-09 21:48:19
70Graph operations / Connectivity / Tree decomposition / Graph / Travelling salesman problem / Tree / Line graph / Chordal graph / Graph theory / NP-complete problems / Graph coloring

Algorithms CS 6820 Fall 2009 Problem Set 5 Due November 11, 2009

Add to Reading List

Source URL: www.cs.cornell.edu

Language: English - Date: 2009-10-30 17:40:59
UPDATE